A Hybrid Spanning Tree algorithm for efficient topology distribution in PNNI

LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and speciic requests. After outside publication, requests should be lled only by reprints or legally obtained copies of the article (e.g., payment of royalties). Abstract The ATM Forum's PNNI standard specifies a flooding mechanism to distribute topological state information amongst nodes participating in a PNNI network. While the flooding mechanism provides robust topology distribution , we show by simulation, that it can disproportionately overload lower-bandwidth links and, due to its inherent redundancy, can generate considerable computational overhead due to the processing of redundant topology updates. To address these issues, we introduce the Hybrid Spanning Tree algorithm, a spanning tree-based topology distribution mechanism that has low computational maintenance and can support policy that restricts topology distribution control traffic from being carried over lower-bandwidth links. Unlike other spanning tree proposals, the Hybrid Spanning Tree algorithm provides a simple and practical migration path to smoothly transition PNNI nodes executing the flooding algorithm to that of the Hybrid Spanning Tree algorithm.